TARSKI’s FUZZY CONSEQUENCES

نویسنده

  • E. Trillas
چکیده

The aim of this paper is to prove that the following two mathematical concepts are equivalent: 1) Fuzzy Preorders which are compatible with an "AND" operation and 2) Fuzzy Consequence Operators (FCO) [8] verifying a finiteness property with respect to that "AND" operation. The role proposed to fuzzy consequences operators is to be a general notion for obtaining approximate consequences from approximate premises [6,8]. So, this paper justifies the use of fuzzy preorders to model the deductive closure of a rule base, as it is made in many Expert Systems [7]. Moreover, as a corollary of this result, we have that all FCOs verifying the finite condition mentioned before are axiomatizable using only the rule of multiple valued Modus Ponens and an appropriate set of logical implications as axioms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STRATIFIED OPERATORS AND GRADED CONSEQUENCE RELATIONS by

1. GRADED DEDUCTIVE TOOLS FOR GRADED INFORMATION In accordance with Tarski’s point of view, we identify a crisp deductive apparatus with a “deduction operator”, i.e. a closure operator D : P(Å)→ P(Å) where Å is the set of formulas in a logic. Given a set X of formulas, we interpret D(X) as the set of logical consequences of X. Now, we can imagine a "stratified" deduction apparatus, i.e. the ava...

متن کامل

Logical consequence revisited

Tarski’s 1936 paper, “On the concept of logical consequence”, is a rather philosophical, non-technical paper that leaves room for conflicting interpretations. My purpose is to review some important issues that explicitly or implicitly constitute its themes. My discussion contains four sections: (1) terminological and conceptual preliminaries, (2) Tarski’s definition of the concept of logical co...

متن کامل

Restricted truth predicates in first-order logic

It is well-known that there exist consistent first-order theories that become inconsistent when we add Tarski’s schema T. This is Tarski’s Theorem. To avoid the inconsistency result, one can restrict Tarski’s schema in different ways. In our paper we restrict Tarski’s schema T by only instantiating the schema with a proper subset of the set of all sentences. We prove several results concerning ...

متن کامل

On Tarski on Models

This paper concerns Tarski’s use of the term “model” in his 1936 paper “On the Concept of Logical Consequence.” Against several of Tarski’s recent defenders, I argue that Tarski employed a non-standard conception of models in that paper. Against Tarski’s detractors, I argue that this non-standard conception is more philosophically plausible than it may appear. Finally, I make a few comments con...

متن کامل

Tarski On Logical Notions

We try to explain Tarski’s conception of logical notions, as it emerges from a lecture of his, delivered in 1966 and published posthumously in 1986 (History and Philosophy of Logic, 7, pp. 143-154), a conception based on the idea of invariance. The evaluation of Tarski’s proposal leads us to consider an interesting (and neglected) reply to Skolem in which Tarski hints at his own point of view o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991